Linear Recurrences through Tilings and Markov Chains
نویسندگان
چکیده
We present a tiling interpretation for kth order linear recurrences, which yields new combinatorial proofs for recurrence identities. Moreover, viewing the tiling process as a Markov chain also yields closed form Binet-like expressions for these recurrences.
منابع مشابه
Dimers, tilings and trees
Generalizing results of Temperley [11], Brooks, Smith, Stone and Tutte [1] and others [10, 7] we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This equivalence provides a measure-preserving bijection between dimer coverings of a weighted bipartite planar graph and spanning trees of the corre...
متن کاملThe Combinatorialization of Linear Recurrences
We provide two combinatorial proofs that linear recurrences with constant coefficients have a closed form based on the roots of its characteristic equation. The proofs employ sign-reversing involutions on weighted tilings.
متن کاملParry Expansions of Polynomial Sequences
We prove that the sum-of-digits function with respect to certain digital expansions (which are related to linear recurrences) and similarly defined functions evaluated on polynomial sequences of positive integers or primes satisfy a central limit theorem. These digital expansions are special cases of numeration systems associated to primitive substitutions on finite alphabets, the digits of whi...
متن کاملMixing times of Lozenge Tiling and Card Shuffling Markov Chains
We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application is to a class of Markov chains introduced by Luby, Randall, and Sinclair to generate random tilings of regions by lozenges. For an l×l region we bound the mix...
متن کاملMixing Times of Plane Random Rhombus Tilings
We address the question of single flip discrete dynamics in sets of two-dimensional random rhombus tilings with fixed polygonal boundaries. Single flips are local rearrangements of tiles which enable to sample the configuration sets of tilings via Markov chains. We determine the convergence rates of these dynamical processes towards the statistical equilibrium distributions and we demonstrate t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001